Optimal consensus set for digital line and plane fitting

نویسندگان

  • Rita Zrour
  • Yukiko Kenmochi
  • Hugues Talbot
  • Lilian Buzer
  • Yskandar Hamam
  • Ikuko Shimizu
  • Akihiro Sugimoto
چکیده

This paper presents a method for fitting a digital line (resp. plane) to a given set of points in a 2D (resp. 3D) image in the presence of outliers. One of the most widely used methods is Random Sample Consensus (RANSAC). However it is also known that RANSAC has a drawback: as maximum iteration number must be set, the solution may not be optimal. To overcome this problem, we present a new method that uses a digital geometric model for lines and planes in a discrete space. Such a digital model allows us to efficiently examine all possible consensus sets, which guarantees the solution optimality and exactness.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Consensus Set for Annulus Fitting

An annulus is defined as a set of points contained between two circles. This paper presents a method for fitting an annulus to a given set of points in a 2D images in the presence of noise by maximizing the number of inliers, namely the consensus set, while fixing the thickness. We present a deterministic algorithm that searches the optimal solution(s) within a time complexity of O(N), N being ...

متن کامل

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

O(n 3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles

This paper presents a method for fitting 4-connected digital circles to a given set of points in 2D images in the presence of noise by maximizing the number of inliers, namely the optimal consensus set, while fixing the thickness. Our approach has a O(nlog n) time complexity and O(n) space complexity, n being the number of points, which is lower than previous known methods while still guarantee...

متن کامل

Optimal Consensus Set for nD Fixed Width Annulus Fitting

This paper presents a method for fitting a nD fixed width spherical shell to a given set of nD points in an image in the presence of noise by maximizing the number of inliers, namely the consensus set. We present an algorithm, that provides the optimal solution(s) within a time complexity O(N logN) for dimension n, N being the number of points. Our algorithm guarantees optimal solution(s) and h...

متن کامل

Efficient Robust Digital Hyperplane Fitting with Bounded Error

We consider the following fitting problem: given an arbitrary set of N points in a bounded grid in dimension d, find a digital hyperplane that contains the largest possible number of points. We first observe that the problem is 3SUM-hard in the plane, so that it probably cannot be solved exactly with computational complexity better than O(N), and it is conjectured that optimal computational com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Imaging Systems and Technology

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2011